A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance
نویسندگان
چکیده
Aligning and comparing two polygonal chains in 3D space is an important problem in many areas of research, like in protein structure alignment. A lot of research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with insightful new results found. On the other hand, as a protein backbone can have as many as 500∼600 vertices, even if a pair of chains are nicely aligned, as long as they are not identical, it is still difficult for humans to visualize their similarity and difference. In 2008, a problem called CPS-3F was proposed to simplify a pair of 3D chains simultaneously under the discrete Fréchet distance. However, it is still open whether CPS-3F is NP-complete or not. In this paper, we first present a new practical method to align a pair of protein backbones, improving the previous method by Jiang et al. Finally, we present a greedy-and-backtrack method, using the new alignment method as a subroutine, to handle the CPS-3F problem. We also prove two simple lemmas, giving some evidence to why our new method works well. Some preliminary empirical results using some proteins from the Protein Data Bank (PDB), with comparisons to the previous method, are presented.
منابع مشابه
Nonlinear Optimization for Human-Like Movements of a High Degree of Freedom Robotics Arm-Hand System
Optimizing the Layout of Proportional Symbol Maps p. 1 An Optimal Hidden-Surface Algorithm and Its Parallelization p. 17 Construction of Pseudo-triangulation by Incremental Insertion p. 30 Non-uniform Geometric Matchings p. 44 Multi-robot Visual Coverage Path Planning: Geometrical Metamorphosis of the Workspace through Raster Graphics Based Approaches A Practical Solution for Aligning and Simpl...
متن کاملOn the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance
Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very little is known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous...
متن کاملProtein Local Structure Alignment Under the Discrete Fréchet Distance
Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the ...
متن کاملSimplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance. In this paper, for the first time, we consider the problem of simplifying 3D polygonal chains under the discrete Fréchet distance. We present efficient polynomial time algorithms for simplifying a single chain, including the first near-linear O(n log n) time exact algorithm for the contin...
متن کاملProtein Structure-Structure Alignment with Discrete Fr'echet Distance
Matching two geometric objects in two-dimensional (2D) and three-dimensional (3D) spaces is a central problem in computer vision, pattern recognition, and protein structure prediction. In particular, the problem of aligning two polygonal chains under translation and rotation to minimize their distance has been studied using various distance measures. It is well known that the Hausdorff distance...
متن کامل